Dual Queue Approach to Improving Network Performance During Transient Congestion Episodes

نویسندگان

  • David A. Hayes
  • Lachlan L. H. Andrew
  • Michael P. Rumsewicz
چکیده

Despite extensive work on the network congestion[Jain, 1990], network congestion remains a real problem. The solution is not one answer, but many. Call admission controls try to limit the number of sessions according to the network’s traffic capacity. Implicit and explicit feedback congestion control techniques are often too slow in reacting to transient conditions. Window, automatic code gapping, and percentage throttling based techniques all exhibit these shortcomings. Explicit feed back techniques may even make the congestion worse. All these techniques play an important part in reducing congestion. However, transitory periods of congestion still occur. Reasons for this include the time taken to react to congestion, the nature of congestion control, and the character of packet traffic itself [Leland et. al., 1994]. For real time services, such as voice, this causes severe degradation in quality or complete loss of service. For interactive services, such as WWW browsing, delays become intolerable and packet retransmission further aggravates the problem. Unfortunately, such problems are likely to occur at relatively low average utilisation levels due to the self-similar nature of most data network traffic [Erramilli et al., 1996]. Given that transient congestion episodes are still a problem, it is necessary to make the network as tolerant as possible to these. This paper proposes an alternative philosophical approach to the problem and demonstrates that it can be implemented using a system of two queues.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Packet Marking Function of Active Queue Management Mechanism: Should It Be Linear, Concave, or Convex?

Recently, several gateway-based congestion control mechanisms have been proposed to support the endto-end congestion control mechanism of TCP (Transmission Control Protocol). In this paper, we focus on RED (Random Early Detection), which is a promising gateway-based congestion control mechanism. RED randomly drops an arriving packet with a probability proportional to its average queue length (i...

متن کامل

VRED: An improvement over RED algorithm by using queue length growth velocity

Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...

متن کامل

VRED: An improvement over RED algorithm by using queue length growth velocity

Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...

متن کامل

On Packet Marking Function of Active Queue Management Mechanism: Should It Be Linear, Concave, or Convex?

Recently, several gateway-based congestion control mechanisms have been proposed to support the endto-end congestion control mechanism of TCP (Transmission Control Protocol). In this paper, we focus on RED (Random Early Detection), which is a promising gateway-based congestion control mechanism. RED randomly drops an arriving packet with a probability proportional to its average queue length (i...

متن کامل

Intelligent Reasoning Approach for Active Queue Management in Wireless Ad Hoc Networks

Mobile ad hoc network is a network without infrastructure where every node has its own protocols and services for powerful cooperation in the network. Every node also has the ability to handle the congestion in its queues during traffic overflow. Traditionally, this was done through DropTail policy where the node drops the incoming packets to its queues during overflow condition. Many studies s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998